Balancing Efficiency and Fairness in Dynamic Kidney Exchange
نویسندگان
چکیده
The preferred treatment for kidney failure is a transplant; however, demand for donor kidneys far outstrips supply. Kidney exchange, an innovation where willing but incompatible donor-patient pairs can exchange organs—via cycles and altruist-initiated chains— provides a life-saving alternative to long waiting lists for deceased-donor organs. Typically, fielded exchanges act myopically, considering only the current pool of pairs when planning the cycles and chains. Yet kidney exchange is inherently dynamic, with participants arriving and departing. Also, many planned exchange transplants do not go to surgery due to various failures. Thus, it is important to consider the future when matching. Motivated by our experience running the computational side of the US nationwide kidney exchange, we present FUTUREMATCH, a framework for learning to match in a general dynamic model. We validate FUTUREMATCH on the real nationwide exchange data. Not only does dynamic matching result in more expected transplants than myopic matching, but also even dynamic matching under economically inefficient objectives that enforce equity can result in statistically significant increases in social welfare over efficient myopic matching.
منابع مشابه
Balancing Lexicographic Fairness and a Utilitarian Objective with Application to Kidney Exchange
Balancing fairness and efficiency in resource allocation is a classical economic and computational problem. The price of fairness measures the worst-case loss of economic efficiency when using an inefficient but fair allocation rule; for indivisible goods in many settings, this price is unacceptably high. One such setting is kidney exchange, where needy patients swap willing but incompatible ki...
متن کاملA Unified Approach to Dynamic Matching and Barter Exchange
The exchange of indivisible goods without money addresses a variety of constrained economic settings where a medium of exchange—such as money—is considered inappropriate. Participants are either matched directly with another participant or, in more complex domains, in barter cycles and chains with many other participants before exchanging their endowed goods. This thesis addresses the design, a...
متن کاملRobust dynamic optimization with application to kidney exchange
Kidney exchange provides a life-saving alternative to long waiting lists for patients in need of a new kidney. We derive a variety of mathematical models for the kidney exchange optimization problem, where the general goal is to maximize some form of social welfare vis-à-vis transplanting kidneys. We explore the implications of making the optimization problem dynamic (considering the future evo...
متن کاملEmpirical Price of Fairness in Failure-Aware Kidney Exchange
Fielded kidney exchanges typically use utilitarian or near-utilitarian matching rules, potentially at great cost to certain classes of hardto-match patients. Dickerson, Procaccia, and Sandholm [6] recently adapted the price of fairness, a measure of the tradeoff between fairness and efficiency, to kidney exchange; they showed that the price of fairness is small in theory but often non-negligibl...
متن کاملRandomized Assignments for Barter Exchanges: Fairness vs. Efficiency
We study fairness and efficiency properties of randomized algorithms for barter exchanges with direct applications to kidney exchange problems. It is well documented that randomization can serve as a tool to ensure fairness among participants. However, in many applications, practical constraints often restrict the maximum allowed cyclelength of the exchange and for randomized algorithms, this i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014